The QBF Gallery: Behind the Scenes

نویسندگان

  • Florian Lonsing
  • Martina Seidl
  • Allen Van Gelder
چکیده

Over the last few years, much progress has been made in the theory and practice of solving quantified Boolean formulas (QBF). Novel solvers have been presented that either successfully enhance established techniques or implement novel solving paradigms. Powerful preprocessors have been realized that tune the encoding of a formula to make it easier to solve. Frameworks for certification and solution extraction emerged that allow for a detailed interpretation of a QBF solver’s results, and new types of QBF encodings were presented for various application problems. To capture these developments the QBF Gallery was established in 2013. The QBF Gallery aims at providing a forum to assess QBF tools and to collect new, expressive benchmarks that allow for documenting the status quo and that indicate promising research directions. The collected benchmarks became the basis for the experiments conducted in the context of the QBF Gallery 2013 and QBF Gallery 2014. In the latter, QBF solvers were evaluated in a competitive setting as part of the FLoC Olympic Games. In contrast to 2014, the edition of the QBF Gallery in 2013 was not competitive and hence no prizes were awarded. In this paper, we report on the setup of the QBF Gallery. To this end, we conducted numerous experiments which allowed us not only to assess the quality of the tools, but also the quality of the benchmarks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games

The QBF Gallery 2014 was a competitive evaluation for QBF solvers organized as part of the FLoC 2014 Olympic Games during the Vienna Summer of Logic. The QBF Gallery 2014 featured three different tracks on formulas in prenex conjunctive normal form (PCNF) including more than 1200 formulas to be solved. Gold, silver, and bronze track medals were awarded to the solvers that solved the most formul...

متن کامل

Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination

Among preprocessing techniques for quantified Boolean formula (QBF) solving, quantified blocked clause elimination (QBCE) has been found to be extremely effective. We investigate the power of dynamically applying QBCE in search-based QBF solving with clause and cube learning (QCDCL). This dynamic application of QBCE is in sharp contrast to its typical use as a mere preprocessing technique. In o...

متن کامل

HordeQBF: A Modular and Massively Parallel QBF Solver

The recently developed massively parallel satisfiability (SAT) solver HordeSAT was designed in a modular way to allow the integration of any sequential CDCL-based SAT solver in its core. We integrated the QCDCL-based quantified Boolean formula (QBF) solver DepQBF in HordeSAT to obtain a massively parallel QBF solver—HordeQBF. In this paper we describe the details of this integration and report ...

متن کامل

SAT-to-SAT in QBFEval 2016

In this short paper, we describe QBF solvers from the latest QBFEval that were based on the SAT-to-SAT solver. We present the main ideas behind the solvers and discuss their strengths and weaknesses.

متن کامل

Partial Implicit Unfolding in the Davis - PutnamProcedure for

Quantiied Boolean formulae ooer a means of representing many propositional formula exponentially more compactly than propo-sitional logic. Recent work on automating reasoning with QBF has concentrated on extending the Davis-Putnam procedure to handle QBF. Although the resulting procedures make it possible to evaluate QBF that could not be eeciently reduced to propositional logic (requiring wors...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 237  شماره 

صفحات  -

تاریخ انتشار 2016